High-Performance Computing Strategies for Complex Engineering Optimization Problems

High-Performance Heuristics for Optimization in Stochastic Traffic Engineering Problems

We consider a stochastic routing model in which the goal is to find the optimal route that incorporates a measure of risk. The problem arises in traffic engineering, transportation and even more abstract settings such as task planning (where the time to execute tasks is uncertain), etc. The stochasticity is specified in terms of arbitrary edge length distributions with given mean and variance v...

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

Fuzzy VIKOR Optimization for Designing High Performance Hydroxyapatite/Polycaprolactone Scaffolds for Hard Tissue Engineering

Automatic Performance Engineering Workflows for High Performance Computing

During the typical performance engineering process, application developers must often complete multiple iterative tasks to get an in-depth runtime profile of their application in order to identify new optimization opportunities and implement an effective tuning strategy. However, the majority of today’s mainstream tools do not support common workflows like analyzing the scalability and stabilit...

Combinatorial Problems in High-Performance Computing: Partitioning

Partitioning is of fundamental importance in high-performance computing: partitioning the data and the associated computational work in an optimal manner leads to good load balance and minimal communication in parallel computations on modern architectures. Often, the computation is irregular and the data set is described by a sparse matrix, a graph, or a hypergraph. This results in a combinator...